MATHEMATICAL ENGINEERING TECHNICAL REPORTS Cone Superadditivity of Discrete Convex Functions
نویسندگان
چکیده
A function f is said to be cone superadditive if there exists a partition of R into a family of polyhedral convex cones such that f(z + x) + f(z + y) ≤ f(z) + f(z + x+ y) holds whenever x and y belong to the same cone in the family. This concept is useful in nonlinear integer programming in that, if the objective function is cone superadditive, the global minimality can be characterized by local optimality criterion involving Hilbert bases. This paper shows cone superadditivity of L-convex and M-convex functions with respect to conic partitions that are independent of particular functions. L-convex and M-convex functions in discrete variables (integer vectors) as well as in continuous variables (real vectors) are considered.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete Hessian Matrix for L-convex Functions
L-convex functions are nonlinear discrete functions on integer points that are computationally tractable in optimization. In this paper, a discrete Hessian matrix and a local quadratic expansion are defined for L-convex functions. We characterize L-convex functions in terms of the discrete Hessian matrix and the local quadratic expansion.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS On Infimal Convolution of M-Convex Functions
The infimal convolution of M-convex functions is M-convex. This is a fundamental fact in discrete convex analysis that is often useful in its application to mathematical economics and game theory. M-convexity and its variant called M-convexity are closely related to gross substitutability, and the infimal convolution operation corresponds to an aggregation. This note provides a succinct descrip...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Note on Multimodularity and L-Convexity
Multimodular functions and L-convex functions have been investigated almost independently, but they are, in fact, equivalent objects that can be related through a simple coordinate transformation. Some facts known for L-convex functions can be translated to new results for multimodular functions, and vice versa. In particular, the local optimality condition for global optimality found in the li...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Cones of Elementary Imsets and Supermodular Functions: a Review and Some New Results
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and c...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete L-/M-Convex Function Minimization Based on Continuous Relaxation
We consider the problem of minimizing a nonlinear discrete function with L-/M-convexity proposed in the theory of discrete convex analysis. For this problem, steepest descent algorithms and steepest descent scaling algorithms are known. In this paper, we use continuous relaxation approach which minimizes the continuous variable version first in order to find a good initial solution of a steepes...
متن کامل